Relational Graph Models at Work

نویسندگان

  • Flavien Breuvart
  • Giulio Manzonetto
  • Domenico Ruoppolo
چکیده

We study the relational graph models that constitute a natural subclass of relational models of λ-calculus. We prove that among the λ-theories induced by such models there exists a minimal one, and that the corresponding relational graph model is very natural and easy to construct. We then study relational graph models that are fully abstract, in the sense that they capture some observational equivalence between λ-terms. We focus on the two main observational equivalences in the λ-calculus, the theory H + generated by taking as observables the β-normal forms, and H * generated by considering as observables the head normal forms. On the one hand we introduce a notion of λ-König model and prove that a relational graph model is fully abstract for H + if and only if it is extensional and λ-König. On the other hand we show that the dual notion of hyperimmune model, together with extensionality, captures the full abstraction for H * .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A suitable data model for HIV infection and epidemic detection

Background: In recent years, there has been an increase in the amount and variety of data generated in the field of healthcare, (e.g., data related to the prevalence of contagious diseases in the society). Various patterns of individuals’ relationships in the society make the analysis of the network a complex, highly important process in detecting and preventing the incidence of diseases....

متن کامل

Graph-based Approximate Counting for Relational Probabilistic Models

One of the key operations inside most relational probabilistic models is counting be it for parameter/structure learning or for efficient inference. However, most approaches use the logical structure for counting and do not exploit any fast counting methods. In this work-inprogress, we explore the closer connections to graph data bases and propose methods that obtain both exact and approximate ...

متن کامل

Dissimilar friction stir lap welding of Al-Mg to CuZn34: Application of grey relational analysis for optimizing process parameters

This study focused on the optimization of Al—Mg to CuZn34 friction stir lap welding (FSLW) process for optimal combination of rotational and traverse speeds in order to yield favorable fracture load using Grey relational analysis (GRA). First, the degree of freedom was calculated for the system. Then, the experiments based on the target values and number of considered levels, corresponding orth...

متن کامل

An Introduction to Temporal Graph Data Management

This paper presents an introduction to the problem of temporal graph data management in the form of a survey of relevant techniques from database management and graph processing. Social network analytics, which focuses on finding interesting facts over static graphs, has gathered much attention lately. However, there hasn’t been much work on analysis of temporal or evolving graphs. We believe t...

متن کامل

Relational Learning and Feature Extraction by Querying over Heterogeneous Information Networks

Many real world systems need to operate on heterogeneous information networks that consist of numerous interacting components of different types. Examples include systems that perform data analysis on biological information networks; social networks; and information extraction systems processing unstructured data to convert raw text to knowledge graphs. Many previous works describe specialized ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1703.10382  شماره 

صفحات  -

تاریخ انتشار 2017